Trigonometric Approximation of SO(N) Loops
نویسندگان
چکیده
منابع مشابه
Approximation By Trigonometric Polynomials
These notes are prepared as lecture notes exclusively for the participants of this conference only. Any reproduction in any media, or any use for any other purpose of any part of this manuscript, without an expressed written consent of the author is unlawful.thorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon. The views and conc...
متن کاملNonperiodic Trigonometric Polynomial Approximation
The most common approach for approximating non-periodic function defined on a finite interval is based on considering polynomials as basis functions. In this paper we will address the non-optimallity of polynomial approximation and suggest to switch from powers of x to powers of sin(px) where p is a parameter which depends on the dimension of the approximating subspace. The new set does not suf...
متن کاملMonotone trigonometric approximation
Let f ∈ C[−ω, ω], 0 < ω < π, be nonlinear and nondecreasing. We wish to estimate the degree of approximation of f by trigonometric polynomials that are nondecreasing in [−ω, ω]. We obtain estimates involving the second modulus of smoothness of f and show that one in general cannot have estimates with the third modulus of smoothness.
متن کاملCircular Approximation by Trigonometric Bézier Curves
Abstract—We present a trigonometric scheme to approximate a circular arc with its two end points and two end tangents/unit tangents. A rational cubic trigonometric Bézier curve is constructed whose end control points are defined by the end points of the circular arc. Weight functions and the remaining control points of the cubic trigonometric Bézier curve are estimated by variational approach t...
متن کاملDiscrete Least Squares Approximation by Trigonometric Polynomials
We present an efficient and reliable algorithm for discrete least squares approximation of a real-valued function given at arbitrary distinct nodes in [0, 2tt) by trigonometric polynomials. The algorithm is based on a scheme for the solution of an inverse eigenproblem for unitary Hessenberg matrices, and requires only O(mn) arithmetic operations as compared with 0(mn ) operations needed for alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constructive Approximation
سال: 2010
ISSN: 0176-4276,1432-0940
DOI: 10.1007/s00365-010-9107-6